High-dimensional Motion Planning using Latent Variable Models via Approximate Inference

نویسندگان

  • Jung-Su Ha
  • Hyeok-Joo Chae
  • Han-Lim Choi
چکیده

In this work, we present an efficient framework to generate a motion trajectory of a robot that has a high degree of freedom (e.g., a humanoid robot). High-dimensionality of the robot configuration space often leads to difficulties in utilizing the widely-used motion planning algorithms because the volume of the decision space increases exponentially with the number of dimensions. To handle complications arising from the large decision space, and to solve a corresponding motion planning problem efficiently, two key concepts were adopted. First, the Gaussian process latent variable model (GPLVM) was utilized for low-dimensional representation of the original configuration space. Second, an approximate inference algorithm was used, exploiting through the duality between control and estimation, to explore the decision space and to compute a high-quality motion trajectory of the robot. Utilizing the GP-LVM and the duality between control and estimation, we construct a fully probabilistic generative model with which we transform a high-dimensional motion planning problem into a tractable inference problem. Finally, we compute the optimal motion trajectory via an approximate inference algorithm based on a variant of the particle filter. Numerical experiments are presented to demonstrate the applicability and validity of the proposed approach. The resulting motions can be viewed in the supplemental video.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Composable, distributed-state models for high-dimensional time series

Composable, distributed-state models for high-dimensional time series Graham William Taylor Doctor of Philosophy Graduate Department of Computer Science University of Toronto, 2009 In this thesis we develop a class of nonlinear generative models for highdimensional time series. The first key property of these models is their distributed, or “componential” latent state, which is characterized by...

متن کامل

Transdimensional approximate Bayesian computation for inference on invasive species models with latent variables of unknown dimension

Accurate information on patterns of introduction and spread of non-native species is essential for making predictions and management decisions. In many cases, estimating unknown rates of introduction and spread from observed data requires evaluating intractable variable-dimensional integrals. In general, inference on the large class of models containing latent variables of large or variable dim...

متن کامل

Training opposing directed models using geometric mean matching

Unsupervised training of deep generative models containing latent variables and performing inference remains a challenging problem for complex, high dimensional distributions. One basic approach to this problem is the so called Helmholtz machine and it involves training an auxiliary model that helps to perform approximate inference jointly with the generative model which is to be fitted to the ...

متن کامل

Approximate Bayesian Inference in Spatial Generalized Linear Mixed Models

In this paper we propose fast approximate methods for computing posterior marginals in spatial generalized linear mixed models. We consider the common geostatistical special case with a high dimensional latent spatial variable and observations at only a few known registration sites. Our methods of inference are deterministic, using no random sampling. We present two methods of approximate infer...

متن کامل

NORGES TEKNISK-NATURVITENSKAPELIGE UNIVERSITET Approximate Bayesian Inference in Spatial Generalized Linear Mixed Models

In this paper we propose fast approximate methods for computing posterior marginals in spatial generalized linear mixed models. We consider the common geostatistical special case with a high dimensional latent spatial variable and observations at only a few known registration sites. Our methods of inference are deterministic, using no random sampling. We present two methods of approximate infer...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • CoRR

دوره abs/1711.08275  شماره 

صفحات  -

تاریخ انتشار 2017